On the domain of the assembly map in algebraic K–theory
نویسنده
چکیده
We compare the domain of the assembly map in algebraic K – theory with respect to the family of finite subgroups with the domain of the assembly map with respect to the family of virtually cyclic subgroups and prove that the former is a direct summand of the later. AMS Classification 19D50; 19A31, 19B28
منابع مشابه
Algebraic K-theory of group rings and the cyclotomic trace map
We prove that the Farrell-Jones assembly map for connective algebraic K-theory is rationally injective, under mild homological finiteness conditions on the group and assuming that a weak version of the Leopoldt-Schneider conjecture holds for cyclotomic fields. This generalizes a result of Bökstedt, Hsiang, and Madsen, and leads to a concrete description of a large direct summand of Kn(Z[G])⊗Z Q...
متن کاملImage encryption based on chaotic tent map in time and frequency domains
The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملAssembly Maps, K-Theory, and Hyperbolic Groups
C. OGLE Department of Mathematics, Ohio State University, Columbus, 0H43210, U.S.A. (Received: March 1992) Abstraet. Following Connes and Moscovici, we show that the Baum-Connes assembly map for K,(C~*n) is rationally injective when n is word-hyperbolic, implying the Equivariant Novikov conjecture for such groups. Using this result in topological K-theory and BoreI-Karoubi regulators, we also s...
متن کامل